9 Depth-first Search
نویسنده
چکیده
We can make this algorithm slightly faster (in practice) by checking whether a node is marked before we recursively explore it. This modification ensures that we call DFS(v) only once for each vertex v. We can further modify the algorithm to define parent pointers and other useful information about the vertices. This additional information is computed by two black-box subroutines PREVISIT and POSTVISIT, which we leave unspecified for now.
منابع مشابه
Iterative Deepening Multiobjective A
Many real-world optimization problems involve multiple objectives which are often conflicting. When conventional heuristic search algorithms such as A* and IDA* are used for solving such problems, then these problems have to be modeled as simple cost minimization or maximization problems. The task of modeling such problems using a single valued criterion has often proved difficult [6]. The prob...
متن کاملDepth-first proof search without backtracking for free-variable clausal tableaux
We analyse the problem of constructing a deterministic proof procedure for free variable clausal tableaux that performs depth-first proof search without backtracking; and we present a solution based on a fairness strategy. That strategy uses weight orderings and a notion of tableau subsumption to avoid proof cycles and it employs reconstruction steps to handle the destructiveness of free variab...
متن کاملDiscovering snake-in-the-box codes through pruning based on the exemplary solutions of an Evolutionary Algorithm
We present a method for searching for simple achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains exemplary snakes using an evolutionary algorithm previously responsible for defining the best-known lower bounds in n-cubes for n = 9, 10, 11, and 12. These snakes are used to define a pruning model that constrains the search space. A depth-first sea...
متن کاملScalable Parallel DFPN Search
We present Scalable Parallel Depth-First Proof Number Search, a new shared-memory parallel version of depth-first proof number search. Based on the serial DFPN 1+ε method of Pawlewicz and Lew, SPDFPN searches effectively even as the transposition table becomes almost full, and so can solve large problems. To assign jobs to threads, SPDFPN uses proof and disproof numbers and two parameters. SPDF...
متن کاملI/O-Efficient Algorithms for Planar Graphs I: Separators∗
We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph G with N vertices and an integer r > 0, a vertex separator of size O (N/√r) that partitions G into O(N/r) subgraphs of size at most r and boundary size O (√r) can be computed in O(sort(N)) I/Os, provided that M ≥ 56r log B. Together with the planar em...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014